Coding at the sample level for data hiding: turbo and concatenated codes

نویسندگان

  • Félix Balado
  • Fernando Pérez-González
چکیده

The performance of data hiding techniques in still images may be greatly improved by means of coding. In previous approaches repetition coding was firstly used to obtain N identical Gaussian channels over which block and convolutional coding were used. But knowing that repetition coding can be improved we may turn our attention to coding forwardly at the sample level. Bounds for both hard and soft decision decoding performance are provided and the use of concatenated coding and turbo coding for this approach is explored.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approaching the capacity limit in image watermarking: a perspective on coding techniques for data hiding applications

An overview of channel coding techniques for data hiding in still images is presented. Use of codes is helpful in reducing the bit error probability of the decoded hidden information, thus increasing the reliability of the system. First, the data hiding problem is statistically modeled for the spatial and DCT domains. Then, the bene"ts brought about by channel diversity are discussed and quanti...

متن کامل

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes - Information Theory, IEEE Transactions on

AbstructA parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction ...

متن کامل

Unveiling turbo codes: some results on parallel concatenated coding schemes

A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the rst encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the rst encoder followed by the parity check bits of both encoders. This construction can be gener...

متن کامل

Design of Parallel Concatenated Convolutional Codes - Communications, IEEE Transactions on

.’ parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001